Grocery distribution plans in urban networks with street crossing penalties

نویسندگان

چکیده

Abstract Following the emergency caused by Covid‐19 pandemic, there is need, among other measures, to modify urban mobility plans in order reduce use of collective public transport, reducing crowding people while also preventing traffic congestion through discouraging private vehicles. From this perspective, retail companies operating within cities must reorganize themselves, considering both unpredictable requirements environmental sustainability and new needs calling for promotion bicycles electric scooters. In context, we deal with need determine minimum cost routes areas delivering orders placed e‐channels. More precisely, face a variant green vehicle routing problem heterogeneous fleets, which objective function includes impact components that differ type. Moreover, as novel issue, attention be paid avoid crossing passing close bicycle lanes; therefore, penalties are associated transit vehicles near lanes. To address problem, propose mixed integer linear programming model matheuristic it. The proposed approach then used analyze different scenarios derived from transportation network city Milan, Italy. Milan one smartest Europe point view but most affected municipality making big investment promote bicycles.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

fault location in power distribution networks using matching algorithm

چکیده رساله/پایان نامه : تاکنون روش‏های متعددی در ارتباط با مکان یابی خطا در شبکه انتقال ارائه شده است. استفاده مستقیم از این روش‏ها در شبکه توزیع به دلایلی همچون وجود انشعاب‏های متعدد، غیر یکنواختی فیدرها (خطوط کابلی، خطوط هوایی، سطح مقطع متفاوت انشعاب ها و تنه اصلی فیدر)، نامتعادلی (عدم جابجا شدگی خطوط، بارهای تک‏فاز و سه فاز)، ثابت نبودن بار و اندازه گیری مقادیر ولتاژ و جریان فقط در ابتدای...

Entropy and order in urban street networks

Many complex networks erase parts of their geometry as they develop, so that their evolution is difficult to quantify and trace. Here we introduce entropy measures for quantifying the complexity of street orientations and length variations within planar networks and apply them to the street networks of 41 British cities, whose geometric evolution over centuries can be explored. The results show...

متن کامل

Topological analysis of urban street networks

The authors propose a topological analysis of large urban street networks based on a computational and functional graph representation. This representation gives a functional view in which vertices represent named streets and edges represent street intersections. A range of graph measures, including street connectivity, average path length, and clustering coefficient, are computed for structura...

متن کامل

Outward Accessibility in Urban Street Networks: Characterization and Improvements

The dynamics of transportation through towns and cities is strongly affected by the topology of the connections and routes. The current work describes an approach combining complex networks and self-avoiding random walk dynamics in order to quantify in objective and accurate manner, along a range of spatial scales, the accessibility of places in towns and cities. The transition probabilities ar...

متن کامل

Topological patterns in street networks of self-organized urban settlements

Many urban settlements result from a spatially distributed, decentralized building process. Here we analyze the topological patterns of organization of a large collection of such settlements using the approach of complex networks. The global efficiency (based on the inverse of shortest-path lengths), robustness to disconnections and cost (in terms of length) of these graphs is studied and their...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Networks

سال: 2021

ISSN: ['0028-3045', '1097-0037']

DOI: https://doi.org/10.1002/net.22061